package com.zj.leetcode.medium;

import java.util.ArrayList;
import java.util.List;

/**
 * @program: algorithm
 * @description: 全排列
 * 46 permutations
 * @author: Zhang Bo
 * @create: 2022-08-04 19:13:29
 **/
public class Permutations {
    public static void main(String[] args) {
        Solution solution = new Permutations().new Solution();
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        /**
         * 1 2 3
         * TODO 还没做完
         * @param nums
         * @return
         */
        public List<List<Integer>> permute(int[] nums) {

            List<List<Integer>> list = new ArrayList<>();
            List<Integer> inList = new ArrayList<>();
            for (int num : nums) {
                inList.add(num);
            }
            return null;

        }

        private void methodThing(int first, List<Integer> inList) {

        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}

